Factorization of the tenth Fermat number
نویسنده
چکیده
We describe the complete factorization of the tenth Fermat number F10 by the elliptic curve method (ECM). F10 is a product of four prime factors with 8, 10, 40 and 252 decimal digits. The 40-digit factor was found after about 140 Mflop-years of computation. We also discuss the complete factorization of other Fermat numbers by ECM, and summarize the factorizations
منابع مشابه
Factorization of the Tenth and Eleventh Fermat Numbers
We describe the complete factorization of the tenth and eleventh Fermat numbers. The tenth Fermat number is a product of four prime factors with 8, 10, 40 and 252 decimal digits. The eleventh Fermat number is a product of five prime factors with 6, 6, 21, 22 and 564 decimal digits. We also note a new 27-decimal digit factor of the thirteenth Fermat number. This number has four known prime facto...
متن کاملFactorization and Palindromic Continued Fractions
Abstract We provide elementary explanations in terms of palindromic continued fraction expansions for the factorization of integers of the form a2 + 1, including Fermat numbers and Cunningham project numbers. This provides a generalization and more complete explanation of the factorization of the sixth Fermat number given by Freeman Dyson at the turn of the century. This explanation may provide...
متن کاملUnique Factorization and Fermat’s Last Theorem Lecture Notes
and of course, the Fermat equation x + y = z. Here x, y, z, w are meant to be considered as indeterminates, and n is a fixed integer. The general problem is to find all integer values for x, y, z, w satisfying the given equation, or to show that no such values exist. This is not something you can simply program a computer to do. In fact, the tenth of Hilbert’s famous 23 open problems for 20th-c...
متن کاملA Description of the Number Field Sieve
The number field sieve is a relatively new method to factor large integers. Its most notable success is the factorization of the ninth Fermat number. It is significantly faster than all known existing integer factoring algorithms. We examine the theoretical underpinnings of the sieve; after understanding how it works, we state the algorithm. We look mostly to the algebraic number theory aspects...
متن کاملThe Factorization of the Ninth Fermat Number
In this paper we exhibit the full prime factorization of the ninth Fermât number Fg = 2512 + 1 . It is the product of three prime factors that have 7, 49, and 99 decimal digits. We found the two largest prime factors by means of the number field sieve, which is a factoring algorithm that depends on arithmetic in an algebraic number field. In the present case, the number field used was Q(v^2). T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 68 شماره
صفحات -
تاریخ انتشار 1999